CCS with Priority

نویسنده

  • Iain Phillips
چکیده

It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of “priority guards” to Milner’s process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assigned fixed levels, so that the same action can have different priority depending where it appears in a program. Unlike in other unstratified accounts of priority in CCS (such as that of Camilleri and Winskel), we treat inputs and outputs symmetrically. We introduce the new calculus, give examples, develop its theory (including bisimulation and equational laws), and compare it with existing approaches. We use leader election problems to show that priority adds expressiveness to both CCS and the π-calculus.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CCS with Priority Guards

It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of “priority guards” to Milner’s process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assi...

متن کامل

Reservation based protocol for resolving priority inversions in composable conveyor systems

A reservation based protocol for resolving priority inversions in decentralized realtime systems that are useful in the domain of advanced manufacturing is presented. The problem of priority inversions is well-known in the real-time systems literature. When there is prioritized access to shared resources, it is natural consequence for a low-priority task to be serviced before a high-priority ta...

متن کامل

XCCS Diagram to CCS Script Conversion Algorithm

The XCCS modelling language can be viewed as a tool supporting fast and faultless development of CCS scripts or as an independent process calculus based on CCS process algebra. Having in mind the first of possible applications, we present an algorithm that converts XCCS diagrams into CCS scripts. This algorithm takes into consideration the priority of actions in the XCCS diagram and aims to ret...

متن کامل

Priority and Maximal Progress are

During the last decade, CCS has been extended in diier-ent directions, among them priority and real time. One of the most satisfactory results for CCS is Milner's complete proof system for observational congruence 28]. Observational congruence is fair in the sense that it is possible to escape divergence, reeected by an axiom recX:(:X + P) = recX:::P. In this paper we discuss observational cong...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007